Analysis of a Flowshop with Finite Capacity Buffers through Heuristic Rules

نویسندگان

  • Faustino Alarcón
  • José P. García
  • Angel Ortiz
  • María del Mar Alemany
چکیده

The production facilities of some factories can be considered as a flowshops. Flowshops are composed of resources arranged serially in r sections or stages where a set of n parts is processed. There are buffers between two consecutive stages. Each part has at most r operations (one per stage) and the flow of the jobs is oneway from stage 1 to stage r. In some companies of this type, the input sequence of items has a very important incidence in the capacity dimension of buffers between stages. Though the capacity dimension problem must have been tackled during the productive and logistic system design phase, it can appear again during the different life-cycle phases of the designed system and due to different circumstances: increasing of customised products, reduction of life-cycle of products, acquisition of new equipment, redesign of the lay-out, changes in processing times and tools, etc. The aim of this study is to analyse the impact of the different sequence heuristic rules on the capacity dimension of the buffers between some of the stages belonging to a shoe factory. The company section under study can be considered as a flowshop. The analysis need arises due to a productive process modification of one of the three stages that affects the processing times of items considerably. Given a set of heuristic rules the company objective is to determine the heuristic that, satisfying the capacity buffers restrictions and considering the new productive data, provides the best results for the company’s criteria.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

This paper investigates the hybrid flowshop scheduling with finite intermediate buffers, whose objective is to minimize the sum of weighted completion time of all jobs. Since this problem is very complex and has been proven strongly NP-hard, a tabu search heuristic is proposed. In this heuristic there are two main features. One is that a scatter search mechanism is incorporated to improve the d...

متن کامل

A Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers

This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of av...

متن کامل

Heuristic algorithms for scheduling in a multiprocessor two-stage flowshop with 0-1 resource requirements

This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional resources which are available in limited quantities at any time. The resource requirements are of 0-1 type. The objective is the minimization of makespan. The problem is NP-ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001